منابع مشابه
Accelerated Bend Minimization
We present an O(n) algorithm for minimizing the number of bends in an orthogonal drawing of a plane graph. It has been posed as a long standing open problem at Graph Drawing 2003, whether the bound of O(n7/4√logn) shown by Garg and Tamassia in 1996 could be improved. To answer this question, we show how to solve the uncapacitated min-cost flow problem on a planar bidirected graph with bounded c...
متن کاملBend Minimization of Ortho-Radial Graph Drawings
We study orthogonal drawings of 4-planar graphs on cylinders—so called ortho-radial drawings. Equivalently these can be regarded as drawings on an ortho-radial grid formed by concentric circles and rays from the center of these circles but excluding the center itself. Ortho-radial drawings form a proper extension of orthogonal drawings in the plane. We present ortho-radial representations as a ...
متن کاملBend Minimization in Planar Orthogonal Drawings Using Integer Programming
We consider the problem of minimizing the number of bends in a planar orthogonal graph drawing. While the problem can be solved via network flow for a given planar embedding of a graph G, it is NP-hard if we consider the set of all planar embeddings of G. Our approach for biconnected graphs combines an integer linear programming (ILP) formulation for the set of all embeddings of a planar graph ...
متن کاملOn the Bend Minimization in Clock Tree Networks
Vias in Clock Distribution Networks (CDNs) are one of the major sources of signal degradation and delay uncertainty. Also they may impact circuit reliability due to their sensitivity to process variations. With feature size reduction these variations will manifest themselves in adverse effects on clock skew and clock jitter. Therefore, via reduction becomes one of the challenging research areas...
متن کاملBend Minimization in Orthogonal Drawings Using Integer Programming
We consider the problem of minimizing the number of bends in an orthogonal planar graph drawing. While the problem can be solved via network ow for a given planar embedding of a graph G, it is NPhard if we consider the set of all planar embeddings of G. Our approach combines an integer linear programming (ILP) formulation for the set of all embeddings of a planar graph with the network ow formu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Graph Algorithms and Applications
سال: 2012
ISSN: 1526-1719
DOI: 10.7155/jgaa.00265